| 翻訳と辞書 |
| Congestion game ： ウィキペディア英語版 |
Congestion game
Congestion games are a class of games in game theory first proposed by Rosenthal in 1973. In a Congestion game we define players and resources, where the payoff of each player depends on the resources it chooses and the number of players choosing the same resource. Congestion games are a special case of potential games. Rosenthal proved that any congestion game is a potential game and Monderer and Shapley (1996) proved the converse: for any potential game, there is a congestion game with the same potential function.
== Motivation ==
Consider a traffic net where two players originate at point ''O'' and need to get to point ''T''. Suppose that node ''O'' is connected to node ''T'' via connection points ''A'' and ''B'', where ''A'' is a little closer than ''B'' (i.e. ''A'' is more likely to be chosen by each player). However, both connection points get easily congested, meaning the more players pass through a point the greater the delay of each player becomes, so having both players go through the same connection point causes extra delay. Good outcome in this game will be for the two players to "coordinate" and pass through different connection points.
Can such outcome be achieved? And if so, what will the cost be for each player?
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「Congestion game」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|